Multilevel augmentation methods for eigen-problems of compact integral operators

Numerical Algorithms - In this paper, we combine the ideas of multilevel augmentation methods for solving integral equations and the shifted-inverse power method to develop a new multilevel...     

污泥基吸附剂对亚甲基蓝和环丙沙星的吸附性能研究

亚甲基蓝和环丙沙星是水体中2种污染物, 对生态环境有潜在危害. 本文以市政剩余活性污泥为原料, 氯化锌为活化剂热解制备污泥基吸附剂, 研究盐酸酸洗浓度、氯化锌浓度、热解温度、热解时间等对污泥基吸附剂吸附水中亚甲基蓝和环丙沙星性能的影响. 结果表明 (1)污泥基吸附剂对亚甲基蓝的吸附性能随盐酸酸洗浓度的增大而增加, 对环丙沙星的吸附性能则随盐酸酸洗浓度的增大呈先降后增趋势, 两者均在1.500mol·L-1盐酸浓度下取得最优值. (2)污泥基吸附剂对亚甲基蓝和环丙沙星的吸附性能随氯化锌浓度和热解温度的增加呈先升后降趋势, 在氯化锌浓度为4.0mol·L-1、热解温度为500℃时有最优值; 随着热解时间的延长, 污泥基吸附剂对亚甲基蓝和环丙沙星的吸附性能分别在500℃热解70min和80min时有最优值. (3)污泥基吸附剂的最佳制备条件为 氯化锌4.0mol·L-1活化2h、500℃热解70min和80min、1.500mol·L-1盐酸酸洗; 以此制得的污泥基吸附剂对亚甲基蓝和环丙沙星的去除率分别为97.7%和96.4%, 平衡吸附量分别为97.9mg·g-1和3.9mg·g-1, 且污泥基吸附剂对亚甲基蓝和环丙沙星的吸附过程均符合准二级动力学方程.     

基于级联PPMgLN晶体的双倍/三倍频双波长激光器

本文演示了紧凑的绿色和近红外双色连续波激光光源,其发射波长分别为516 nm和775 nm。设计并制造了级联的周期性极化掺镁铌酸锂晶体,用于同时转换通信波长的二次谐波(SHG)和三次谐波(THG),可以在相同温度下获得绿色和近红外激光的输出。通过建立一个单程激光测量系统,在2 W泵浦功率下获得516 nm的0.15 mW绿光和775 nm的1.19 mW的光,晶体温度控制在30.8 ℃。实验结果将为单激光器泵浦的紧凑型双波长共线激光器提供重要的案例。     

Comparison of different methodologies for the computation of damped nonlinear normal modes and resonance prediction of systems with non-conservative nonlinearities

Nonlinear Dynamics - The nonlinear modes of a non-conservative nonlinear system are sometimes referred to as damped nonlinear normal modes (dNNMs). Because of the non-conservative...     

射频等离子制备石墨烯负载Co3O4催化剂及其析氧性能研究

氢能的引入能有效提升配电网的供电可靠性,而电解水制氢是实现低碳转型的关键技术,开发高效的电解水催化剂势在必行。过渡金属氧化物储量大、催化活性高,是具有广阔应用前景的析氧反应催化剂。本文通过射频等离子体处理制备石墨烯上负载Co₃O₄析氧催化剂,XRD、Raman和XPS测试结果显示,二维结构石墨烯的引入加速表面电子迁移,增大了反应面积。等离子体处理促进了纳米粒子在石墨烯上的负载,利用等离子体刻蚀作用在催化剂表面制造出大量碳结构缺陷和氧空位结构,改善了活性位点分布,有效调控Co₃O₄电子结构,提高析氧催化活性。电化学测试表明,本文中合成的Co₃O₄@rGO在电流密度为50 mA·cm^-2时的过电位为410 mV,动力学反应速率较快,表现出优于商业IrO₂的析氧催化活性。     

Gold-Catalyzed Divergent Ring-Opening Rearrangement of Cyclopropenes Enabled by Dichotomous Gold−Carbenes

The gold-catalyzed ring-opening rearrangement of cyclopropenes affords an efficient route to either polysubstituted naphthols or aryl-substituted furans. Owing to the unique dichotomy of gold−carbenes, this protocol provides a switchable reaction selectivity between naphthols and furans enabled by the use of TFP−Au(MeCN)SbF₆ (tri(2-furyl) phosphine) or PNP(AuNTf₂)₂ (bis(diphenylphosphino)(isopropyl) amine) as catalysts respectively. It is proposed that the gold−carbene intermediate might be involved in the cyclopropene→naphthol rearrangement while the gold-carbocation is more likely to be involved in the cyclopropene→furan rearrangement.     

Auto-deposition of 210Bi and 210Po on nickel discs and their application in the analysis of natural waters

Journal of Radioanalytical and Nuclear Chemistry - This study presents a time-efficient method of analysing 210Pb, 210Bi, and 210Po in natural waters. The optimum pH (1.00), temperature...     

Finding any given 2‐factor in sparse pseudorandom graphs efficiently

Given an $n$‐vertex pseudorandom graph $G$ and an $n$‐vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, that is, an embedding $\phi :V\left(H\right)\to V\left(G\right)$ so that $\phi \left(u\right)\phi \left(v\right)\in E\left(G\right)$ for all $uv\in E\left(H\right)$. Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in $G$. Here, we provide a deterministic polynomial time algorithm that finds a given $H$ in any suitably pseudorandom graph $G$. The pseudorandom graphs we consider are $\left(p,\lambda \right)$‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, $\mathrm{\Omega }\left(pn\right)$. A $\left(p,\lambda \right)$‐bijumbled graph is characterised through the discrepancy property: $|e\left(A,B\right)?p|A||B||<\lambda \sqrt{|A||B|}$ for any two sets of vertices $A$ and $B$. Our condition $\lambda =O(p^{2}n/\log n)$ on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications.